منابع مشابه
Depression; Let\'s talk
April 7 is known as “World Health Day” and one of the main responsibilities of World Health Organization is to improve the knowledge of the world population in order to prevent various diseases(1). This organization selects an illness or a disorder in terms of a unique slogan in order to plan for educational, prevention, curative and re-strengthening the operation of countries aroun...
متن کاملHigh LET constraints on low LET survival.
Survival curves for biological cells irradiated with gamma rays (and other low LET radiations) cannot be properly interpreted without examining the implications of these interpretations for high LET radiations. The theory of RBE demands that the RBE of any high LET radiation field is at most one when the probability for cell killing as a function of the absorbed dose of gamma rays is linear or ...
متن کاملn Let �:=
3.2 Likelihood equations and errors-in-variables regression; Solari's example.. Here is a case, noted by Solari (1969), where the likelihood equations (3.1.1) have solutions, none of which are maximum likelihood estimates. be observed points in the plane. Suppose we want to do a form of " errors in variables " regression, in other words to fit the data by a straight line, assuming normal errors...
متن کاملProof : Let
The asynchronous computability theorem for t-resilient tasks. A simple constructive computability theorem for wait-free computation. a spanning tree of G, starting (and ending) at a leaf, and then omitting the last two edges of the tour). Let V be an arbitrary set of n-dimensional vectors such that the adjacency graph G(V) is connected. We now complete the proof of Theorem 2.1 by presenting a w...
متن کاملProof: Let
The PCP theorem states that NP PCP(log n; (log n) c). We build gradually towards its proof. As an intermediate step we show that NP PCP(log n; (log n) c) for some constant c > 1. The presentation here is taken in most parts from 4] (which is heavily based on 2], where NP PCP(log n log log n; log n log log n) was proved. We save a log log n factor in the number of random bits (at a cost of a pol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Dela
سال: 2009
ISSN: 1854-1089,0354-0596
DOI: 10.4312/dela.32.7.135-153